Multi-objective scheduling on two dedicated processors

Scheduling multiprocessor tasks on dedicated processors

Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring

Semi-online scheduling on two uniform processors

In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, ...

Scheduling multiprocessor tasks on two parallel processors

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.

Multi-objective Scheduling onto Heterogeneous Processors System Using Ant System & Fuzzy Logic Controller

In recent years, the static and the dynamic jobs scheduling onto heterogeneous processors present a very well studied problem. Typically the Data Grid Scheduling problem (DGS) has recently become an active research area. The heterogeneous processors scheduling problem (HPSP) can be formulated in several ways and the efficient scheduling of the HPSP on the available resources is one of the key f...